Expected time analysis for Delaunay point location

نویسندگان

  • Luc Devroye
  • Christophe Lemaire
  • Jean-Michel Moreau
چکیده

Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first locate a point close to the query point. For points uniformly distributed on the unit square, we show that the expected point location complexities are Θ( √ n) for the Green-Sibson rectilinear search, Θ(n) for Jump and Walk, Θ(n) for BinSearch and Walk (which uses a 1-dimensional search tree), Θ(n) for search based on a random 2-d tree, and Θ(logn) for search aided by a 2-d median tree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast delaunay point location with search structures

We study the expected time behaviour of the Jumpand-walk paradigm when the set of sites is controlled by a binary search tree or a well-balanced 2-d tree. Throughout the paper, we shall assume that we are given a Delaunay triangulation on N sites uniformly distributed in the unit 2-dimensional square, [0; 1]. We are requested to locate a query point q, which will be assumed to be bounded away f...

متن کامل

Pii: S0925-7721(98)00035-2

This paper studies the point location problem in Delaunay triangulations without preprocessing and additional storage. The proposed procedure finds the query point by simply “walking through” the triangulation, after selecting a “good starting point” by random sampling. The analysis generalizes and extends a recent result for d = 2 dimensions by proving this procedure takes expected time close ...

متن کامل

Simple and Efficient Distribution-Sensitive Point Location, in Triangulations

We analyze, implement, and evaluate a distributionsensitive point location algorithm based on the classical Jump & Walk, called Keep, Jump, & Walk. For a batch of query points, the main idea is to use previous queries to improve the current one. In practice, Keep, Jump, & Walk is actually a very competitive method to locate points in a triangulation. Regarding point location in a Delaunay trian...

متن کامل

Linear-Time Delaunay Triangulations Simplified∗

Recently it was shown that — under reasonable assumptions — Voronoi diagrams and Delaunay triangulations of planar point sets can be computed in time o(n log n), beating the classical comparisonbased lower bound. A number of increasingly faster randomized algorithms have been proposed, most recently a linear-time algorithm based on a randomized incremental construction that uses a combination o...

متن کامل

How To Place a Point to Maximize Angles

We describe a randomized algorithm that, given a set P of points in the plane, computes the best location to insert a new point p, such that the Delaunay triangulation of P ∪ {p} has the largest possible minimum angle. The expected running time of our algorithm is at most cubic, improving the roughly quartic time of the best previously known algorithm. It slows down to slightly super-cubic if w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Geom.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2004